High-Performance Architecture of Elliptic Curve Scalar Multiplication
نویسندگان
چکیده
منابع مشابه
High-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF(2m)
This paper proposes an efficient pipelined architecture of elliptic curve scalar multiplication (ECSM) over GF(2 m ). The architecture uses a bit-parallel finite field (FF) multiplier accumulator (MAC) based on the Karatsuba–Ofman algorithm. The Montgomery ladder algorithm is modified for better sharing of execution paths. The data path in the architecture is well designed, so that the critical...
متن کاملHigh Performance Architecture for Elliptic Curve Scalar Multiplication over GF(2m)
We propose a new architecture for performing Elliptic Curve Scalar Multiplication (ECSM) on elliptic curves over GF (2). This architecture maximizes the parallelism that the projective version of the Montgomery ECSM algorithm can achieve. It completes one ECSM operation in about 2(m−1)(dm/De+4)+m cycles, and is at least three times the speed of the best known result currently available. When im...
متن کاملA Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF (2). To minimize the gate area of the architecture, we use the common Z projective coordinate system where a common Z value is kept for two elliptic curve points during the calculations, which results in one register reduction. In addition, by reusing the registers we are...
متن کاملFast GPGPU-Based Elliptic Curve Scalar Multiplication
This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...
متن کاملAtomicity Improvement for Elliptic Curve Scalar Multiplication
Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2008
ISSN: 0018-9340
DOI: 10.1109/tc.2008.133